Verified reductions for optimization

نویسندگان

چکیده

Abstract Numerical and symbolic methods for optimization are used extensively in engineering, industry, finance. Various to reduce problems of interest ones that amenable solution by these methods. We develop a framework designing applying such reductions, using the Lean programming language interactive proof assistant. Formal verification makes process more reliable, availability an ambient mathematical library provides robust environment constructing reductions reasoning about them.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A second-order pruning step for verified global optimization

We consider pruning steps used in a branch-and-bound algorithm for veri ed global optimization. A rst-order pruning step was given by Ratz using automatic computation of a rst-order slope tuple [21, 22]. In this paper, we introduce a second-order pruning step which is based on automatic computation of a second-order slope tuple. We add this second-order pruning step to the algorithm of Ratz. Fu...

متن کامل

A Formally Verified Generic Branching Algorithm for Global Optimization

This paper presents a formalization in higher-order logic of a generic algorithm that is used in automated strategies for solving global optimization problems. It is a generalization of numerical branch and bound algorithms that compute the minimum of a function on a given domain by recursively dividing the domain and computing estimates for the range of the function on each sub-domain. The cor...

متن کامل

Verified global optimization for estimating the parameters of nonlinear models

Nonlinear parameter estimation is usually achieved via the minimization of some possibly non-convex cost function. Interval analysis provides tools for the guaranteed characterization of the set of all global minimizers of such a cost function when a closed-form expression for the output of the model is available or when this output is obtained via the numerical solution of a set of ordinary di...

متن کامل

Peek: A Formally Verified Peephole Optimization Framework for x86

Peek is a first step toward adding support for assembly-level program analyses, transformations, and optimizations in CompCert. Currently, Peek focuses on x86 peephole transformations implemented and verified in Coq. Peek is designed to provide a modular interface requiring that each peephole optimization satisfy only local correctness properties. Our primary result establishes that, assuming t...

متن کامل

Compiler-Optimization of Implicit Reductions for Distributed Memory Multiprocessors

This paper presents reduction recognition and parallel code generation strategies for distributed-memory multiprocessors. We describe techniques to recognize a broad range of implicit reduction operations, including those involving statements at multiple loop nesting levels and intermixed with conditional control flow. We introduce two new optimizations: factoring which increases data locality ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2023

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-30820-8_8